computational complexity theory - PDFSEARCH.IO - Document Search Engine

computational complexity theory
Results: 2049

#	Item
711	Oblivious and Non-Oblivious Local Search for Combinatorial Optimization by Justin Ward Add to Reading List Source URL: tspace.library.utoronto.ca Language: English - Date: 2013-01-07 16:15:02 Computational complexity theory Operations research Mathematical optimization Greedy algorithm Matroid theory Submodular set function Combinatorial optimization Optimization problem Algorithm Theoretical computer science Mathematics Applied mathematics
712	Average Case Lower Bounds for Monotone Switching Networks Yuval Filmus, Toniann Pitassi, Robert Robere and Stephen A. Cook Department of Computer Science University of Toronto Toronto, Canada {yuvalf, toni, robere, sacoo Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2013-08-15 23:12:55 Order theory Computational complexity theory Functional analysis Monotonic function Real analysis Circuit complexity FO Aanderaa–Karp–Rosenberg conjecture Galois connection Theoretical computer science Mathematics Mathematical analysis
713	Preliminaries Decision Problems Optimisation Problems Descriptive Complexity of Optimisation Problems Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:10 Mathematics Computational complexity theory Logic Model theory FO Structure P SO Descriptive complexity theory Applied mathematics Complexity classes Finite model theory
714	Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Dynamic programming Subset sum problem Bin packing problem Approximation algorithm Complexity classes Combinatorial optimization NP Partition problem Theoretical computer science Computational complexity theory Applied mathematics
715	Advanced Algorithms – COMS31900Lecture 16 Approximation Algorithms (part one) P, NP and constant factor approximations Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Applied mathematics NP-complete NP-hard P versus NP problem NP Polynomial-time reduction P Complete Reduction Theoretical computer science Computational complexity theory Complexity classes
716	C HICAGO J OURNAL OF T HEORETICAL C OMPUTER S CIENCE 2012, Article 07, pages 1–24 http://cjtcs.cs.uchicago.edu/ Computational Models with No Linear Speedup Amir M. Ben-Amram Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2012-12-14 16:46:25 Computability theory Computational complexity theory Computational resources Models of computation Linear speedup theorem Universal Turing machine Speedup theorem DTIME Time complexity Theoretical computer science Applied mathematics Turing machine
717	Improving Exhaustive Search Implies Superpolynomial Lower Bounds Ryan Williams∗ IBM Almaden Research Center May 4, 2010 Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2010-05-04 16:48:34 Complexity classes Computational resources Mathematical optimization Structural complexity theory Advice NTIME Probabilistically checkable proof NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
718	Multivariate Algorithmics for NP-Hard String Problems Laurent Bulteau∗ Falk Hüffner† Christian Komusiewicz Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-01-11 10:59:55 NP-complete problems Complexity classes Analysis of algorithms String Closest string Parameterized complexity Kernelization Time complexity Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
719	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
720	Defining lines of maximum probability for the design of patrol vessel itineraries Fernando Bação1 Victor Lobo2 1 ISEGI-UNL Add to Reading List Source URL: itcnt05.itc.nl Language: English - Date: 2008-09-22 04:53:24 NP-complete problems Operations research Neural networks Dimension reduction Travelling salesman problem Self-organizing map SOM NP Theoretical computer science Computational complexity theory Applied mathematics

UPDATE